How is a chordal graph like a supersolvable binary matroid?
نویسندگان
چکیده
منابع مشابه
How is a chordal graph like a supersolvable binary matroid?
Let G be a finite simple graph. From the pioneering work of R. P. Stanley it is known that the cycle matroid of G is supersolvable if and only if G is chordal. The chordal binary matroids are not in general supersolvable. Nevertheless we prove that every supersolvable binary matroid determines canonically a chordal graph.
متن کاملSupersolvable Frame-matroid and Graphic-lift Lattices
A geometric lattice is a frame if its matroid, possibly after enlargement, has a basis such that every atom lies under a join of at most two basis elements. Examples include all subsets of a classical root system. Using the fact that nitary frame matroids are the bias matroids of biased graphs, we characterize modular coatoms in frames of nite rank and we describe explicitly the frames that are...
متن کاملSupersolvable and Modularly Complemented Matroid Extensions
Finite point configurations in projective spaces are combinatorially described by matroids, where full (finite) projective spaces correspond to connected modular matroids. Every representable matroid can in fact be extended to a modular one. However, we show that some matroids do not even have a modularly complemented extension. Enlarging the class of “ambient spaces” under consideration, we sh...
متن کاملBinary Supersolvable Matroids and Modular Constructions
Let Jt be the class of binary matroids without a Fano plane as a submatroid. We show that every supersolvable matroid in JÍ is graphic, corresponding to a chordal graph. Then we characterize the case that the modular join of two matroids is supersolvable. This is used to study modular flats and modular joins of binary supersolvable matroids. We decompose supersolvable matroids in JH as modular ...
متن کاملMinors of a Random Binary Matroid
Let A = An,m,k be a random n × m matrix over GF2 where each column consists of k randomly chosen ones. Let M be an arbirary fixed binary matroid. We show that if m/n and k are sufficiently large then as n → ∞ the binary matroid induced by A contains M as a minor.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.08.004